Decentralized Finite-Time Stabilization of Multi-Agent Systems with Invertible and Non-Invertible Input-Output Links
نویسندگان
چکیده
منابع مشابه
Finite-time Flocking of Multi-agent System with Input Saturation
In this paper a finite-time flocking of multi-agent system with input saturation is investigated. By introducing a new control protocol, it is show that speed and position of agents with double-integrator dynamics converge to the speed and position of leader in finite time. It is assumed that the graph between the agents is connected and that at least one agent is informed of the leader speed a...
متن کاملInput-output finite time stabilization of linear systems
In this paper the problem of input-output finite-time stabilization of linear time-varying systems is dealt with. The classical definition of input-output finite-time stability (IO-FTS) is extended to that one of structured IO-FTS, which allows to incorporate, in the definition of the stabilization problem, some amplitude constraints on the control input variables. A sufficient condition and a ...
متن کاملOutput Consensus Control of Nonlinear Non-minimum Phase Multi-agent Systems Using Output Redefinition Method
This paper concerns the problem of output consensus in nonlinear non-minimum phase systems. The main contribution of the paper is to guarantee achieving consensus in the presence of unstable zero dynamics. To achieve this goal, an output redefinition method is proposed. The new outputs of agents are functions of original outputs and internal states and defined such that the dynamics of agents a...
متن کاملFinite time stabilization of time-delay nonlinear systems with uncertainty and time-varying delay
In this paper, the problem of finite-time stability and finite-time stabilization for a specific class of dynamical systems with nonlinear functions in the presence time-varying delay and norm-bounded uncertainty terms is investigated. Nonlinear functions are considered to satisfy the Lipchitz conditions. At first, sufficient conditions to guarantee the finite-time stability for time-delay nonl...
متن کاملInvertible calculation's non-invertibility
In cryptosystem theory, it is well-known that a logical mapping that returns the same value that was used as its argument can be inverted with a zero failure probability in linear time. In this paper, however, I show that such a mapping, while trivially assigning a logical state to itself, comes up against an impassable entropy wall such that its computational path is undone inside the threshol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2016
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2016.10.257